Fast Compression of Meshes for GPU Ray-Tracing

نویسندگان

  • Vasco S. Costa
  • João Madeiras Pereira
  • Joaquim A. Jorge
چکیده

We present a novel and expedite way to compress triangles meshes, fans and strips for ray-tracing on a GPU. Our approach improves on the state of the art by allowing the lossless compression of all connectivity information without changing the mesh configuration, while using linear time and space with the number of primitives. Furthermore, the algorithm can be run on a stream processor and any compressed primitive can be indexed in constant time, thus allowing fast random-access to geometry data to support ray-tracing on a GPU. Furthermore, both triangle and quad meshes compress particularly well, as do many type-specialized mesh structures where all primitives have an equal number of vertexes. Our results show that the compression algorithm allows storing and ray-tracing meshes with tens of millions of triangles on commodity GPUs with only 1GB of memory.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast GPU ray tracing of dynamic meshes using geometry images

Using the GPU to accelerate ray tracing may seem like a natural decision due to the highly parallel nature of the problem. However, past attempts at a fully general GPU ray tracer have yielded poor performance compared to optimized CPU ray tracers. In this paper we instead focus on an algorithm for quick intersection of a single mesh on the GPU. The algorithm uses a threaded bounding volume hie...

متن کامل

Interactive Ray Tracing of Massive and Deformable Models

Christian Lauterbach: Interactive Ray Tracing of Massive and Deformable Models. (Under the direction of Dinesh Manocha.) Ray tracing is a fundamental algorithm used for many applications such as computer graphics, geometric simulation, collision detection and line-of-sight computation. Even though the performance of ray tracing algorithms scales with the model complexity, the high memory requir...

متن کامل

Ray tracing implicit surfaces on the GPU

In this paper we examine the methods of rendering implicit surfaces with a per-pixel approach. Ray tracing the implicit model directly has several benefits as opposed to processing tessellated meshes, but also invokes new kinds of problems. The main challenge is efficiently finding the first ray-surface intersection point where the surface is not given in an explicit form. Our implementation us...

متن کامل

Hybrid CPU/GPU KD-Tree Construction for Versatile Ray Tracing

We propose an hybrid CPU-GPU ray-tracing implementation based on an optimal Kd-Tree as acceleration structure. The construction and traversal of this KD-tree takes benefit from both the CPU and the GPU to achieve high-performance ray-tracing on mainstream hardware. Our approach, flexible enough to use only a single computing unit (CPU or GPU), is able to efficiently distribute workload between ...

متن کامل

Fast Hardware Construction and Refitting of Quantized Bounding Volume Hierarchies

There is recent interest in GPU architectures designed to accelerate ray tracing, especially on mobile systems with limited memory bandwidth. A promising recent approach is to store and traverse Bounding Volume Hierarchies (BVHs) [KK86], used to accelerate ray tracing, in low arithmetic precision. However, so far there is no research on refitting or construction of such compressed BVHs, which i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013